package a10_动态规划;

/**
 * <p>
 * a44_最长公共子序列复习1
 * </p>
 *
 * @author flyduck
 * @since 2025/2/27
 */
public class a44_最长公共子序列复习1 {
    //dp[i][j]：长度为0~i-1的chars1和长度为0~j-1的chars2的最长公共子序列

    // if(chars1[i-1] == chars2[j-1]){
    //     dp[i][j] = dp[i-1][j-1] + 1;
    // }else{
    //     dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
    // }
    public int longestCommonSubsequence(String text1, String text2) {
        char[] chars1 = text1.toCharArray();
        char[] chars2 = text2.toCharArray();

        int[][] dp = new int[chars1.length+1][chars2.length+1];

        for (int i = 1; i <= chars1.length; i++) {
            for (int j = 1; j <= chars2.length; j++) {
                if(chars1[i-1] == chars2[j-1]){
                    dp[i][j] = dp[i-1][j-1] + 1;
                }else {
                    dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]);
                }
            }
        }

        return dp[chars1.length][chars2.length];
    }
}
